All Classes
| Class | Description |
|---|---|
| AlphaBetaBot |
This bot performs just as well as
MinMaxBot but expands
significantly fewer nodes by intelligently pruning the tree. |
| Bot |
A bot is an artificially intelligent agent which, given the state of game,
decides which move to make next.
|
| Decision | |
| Game |
Plays a game of Tic Tac Toe and measures how many moves each player
considers during the game.
|
| GameTree |
A game tree is a representation of all the possible states that could occur
during the play of game and how one state is reached from another.
|
| Main |
Plays
NUMBER_OF_GAMES games of Tic Tac Toe and reports the results. |
| MinMaxBot |
This bot expands the entire game tree and makes its decision based on Min
Max search.
|
| Move |
Represents an individual move in a game of Tic Tac Toe.
|
| Player |
The two possible Tic Tac Toe players: X and O.
|
| RandomBot |
A random Tic Tac Toe bot simply chooses its next move at random from all the
available next moves.
|
| State |
Represents the current state of a Tic Tac Toe game.
|
| Utility |
A utility function measures how desirable a given state is for some agent.
|